The Hamming weight of the non-adjacent-form under various input statistics
نویسندگان
چکیده
The Hamming weight of the non-adjacent form is studied in relation to the Hamming weight of the standard binary expansion. In particular, we investigate the expected Hamming weight of the NAF of a n-digit binary expansion with k ones where k is either fixed or proportional to n. The expected Hamming weight of NAFs of binary expansions with large (≥ n/2) Hamming weight is studied. Finally, the covariance of the Hamming weights of the binary expansion and the NAF is computed. Asymptotically, these Hamming weights become independent and normally distributed.
منابع مشابه
Hamming Weight of the Non - Adjacent - Form under Various Input Statistics
The Hamming weight of the non-adjacent form is studied in relation to the Hamming weight of the standard binary expansion. In particular, we investigate the expected Hamming weight of the NAF of a n-digit binary expansion with k ones where k is either fixed or proportional to n. The expected Hamming weight of NAFs of binary expansions with large (≥ n/2) Hamming weight is studied. Finally, the c...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملMinimal weight expansions in Pisot bases
Abstract. For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of finding representations with minimal weight has been solved for integer bases, e.g. by the non-adjacent form in base 2. In this paper, we consider numeration systems with respect to real bases β which are Pi...
متن کاملAutomata in SageMath - Combinatorics meet Theoretical Computer Science
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved using SageMath. In particular, we compute the asymptotic Hamming weight of a non-adjacent-form-like digit expansion, which was not known before.
متن کاملMultilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes
The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Periodica Mathematica Hungarica
دوره 55 شماره
صفحات -
تاریخ انتشار 2007